Computational complexity - PDFSEARCH.IO - Document Search Engine

Computational complexity
Results: 2253

#	Item
631	Join seminar The Hong Kong University of Science and Technology Approximation Algorithms for Perishable Inventory Systems Dr. Xiting Gong Add to Reading List Source URL: www.bm.ust.hk Language: English - Date: 2014-03-13 04:17:53 Supply chain management Marketing Computational complexity theory Approximation algorithm Inventory Systems engineering Business Technology Operations research
632	CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 Minimizing the endpoint trace length of rod motions amidst polygonal obstacles is NP-hard Extended Abstract Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-01-08 18:44:37 Applied mathematics Optical devices Network theory NP Shortest path problem Beam splitter Theoretical computer science Computational complexity theory Complexity classes
633	URL: http://www.elsevier.nl/locate/entcs/volume61.html 19 pages Parameterized Complexity: The Main Ideas and Connections to Practical Computing Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:10:30 NP-complete problems Analysis of algorithms Complexity classes Parameterized complexity Dominating set Kernelization Vertex cover Clique problem NP-complete Theoretical computer science Computational complexity theory Applied mathematics
634	Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints∗ Ariel Kulik† Hadas Shachnai‡ Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2011-10-04 12:29:59 Approximation algorithms Complexity classes Polynomial-time approximation scheme Optimization problem APX Parameterized complexity Bin packing problem PTAS reduction Theoretical computer science Applied mathematics Computational complexity theory
635	Adaptive Informative Path Planning in Metric Spaces Zhan Wei Lim, David Hsu, and Wee Sun Lee National University of Singapore, Singapore, Singapore Abstract. In contrast to classic robot motion planning, informati Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2014-07-16 20:39:51 Operations research Approximation algorithm Computational complexity theory Travelling salesman problem Algorithm XTR Theoretical computer science Mathematics Applied mathematics
636	Small, Stupid, and Scalable: Secure Computing with Faerieplay∗ Alexander Iliev Sean W. Smith Add to Reading List Source URL: www.cs.dartmouth.edu Language: English - Date: 2010-11-08 12:53:14 Secure multi-party computation Circuit complexity Circuit Lookup table Boolean circuit Advantage Randomized algorithm Blinding Field-programmable gate array Theoretical computer science Applied mathematics Computational complexity theory
637	CS 373: Combinatorial Algorithms, Spring 1999 Final Exam (May 7, 1999) Name: Net ID: Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:54:06 Analysis of algorithms NP-complete problems Operations research Mathematical optimization Dynamic programming Randomized algorithm Algorithm Time complexity Knapsack problem Theoretical computer science Computational complexity theory Applied mathematics
638	Meeting the Deadline: On the Complexity of Fault-Tolerant Continuous Gossip ∗ † Chryssis Georgiou Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2011-11-17 23:45:09 Analysis of algorithms Human communication Complexity classes Gossip protocol Network architecture Randomized algorithm Consensus Time complexity Distributed computing Theoretical computer science Computational complexity theory Applied mathematics
639	Originally published in Proc. 3rd WALCOM, LNCS. Springer, 2009. To appear. Parameterized Complexity of Stabbing Rectangles and Squares in the Plane Michael Dom1 and Michael R. Fellows2,⋆ and Frances A. Rosamond2,⋆ 1 Add to Reading List Source URL: theinf1.informatik.uni-jena.de Language: English - Date: 2008-12-19 10:15:00 Applied mathematics Computational complexity theory Quadrilaterals Rectangle Matrix Dominating set Vertex cover Parameterized complexity Clique Theoretical computer science NP-complete problems Mathematics
640	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 A Distributed Algorithm for Approximate Mobile Sensor Coverage Esther Ezra∗ Jiemin Zeng† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-07-29 13:44:18 NP-complete problems Complexity classes Approximation algorithms Operations research Set cover problem Polynomial-time approximation scheme Time complexity Linear programming relaxation NP Theoretical computer science Computational complexity theory Applied mathematics

UPDATE